SERCON-BASED TIMESTAMPED VIRTUAL MACHINE MIGRATION SCHEME FOR CLOUD

With the advent of cloud computing, the need for deploying multiple virtual machines (VMs) on multiple hosts to address the ever-increasing user demands for services has raised concerns regarding energy consumption. Considerable energy is consumed while keeping the data centers with a large number of servers active. However, in data centers, there are cases where these servers may not get utilized efficiently. There can be servers that consume sufficient energy while running resources for a small task (demanding fewer resources), but there can also be servers that receive user requests so frequently that resources may be exhausted, and the server becomes unable to fulfill requests. In such a scenario, there is an urgent need to conserve energy and resources which is addressed by performing server consolidation. Server consolidation aims to reduce the total number of active servers in the cloud such that performance does not get compromised as well as energy is conserved in an attempt to make each server run to its maximum. This is done by reducing the number of active servers in a data center by transferring the workload of one or more VM(s) from one server to another, referred to as VM Migration (VMM). During VMM, time is supposed as a major constraint for effective and user-transparent migration. Thus, this paper proposes a novel VM migration strategy considering time sensitivity as a primary constraint. The aim of the proposed Time Sensitive Virtual Machine Migration (TS-VMM) is to reduce the number of migrations to a minimum with effective cost optimization and maximum server utilization

Voice performance analysis using voice codec by packet fragmentation and contention free periods in wireless networks

The admission control is required to maintain the established route between the source and the destination in the wireless network. To maintain the stability of the route, the wireless channel parameters has to be adopted appropriately. Thus, this study analyzes the wireless access medium parameter through direct coordination (DCF) and point-to-point coordination method. The packets are fragmented in DCF and contention free period interval are adjusted to study the QoS parameters for various VOIP codec using OPNET simulation tool. The result shows that packet fragmentation to 256 bytes and contention free period for 20 ms improves QoS for G.729 for Voice traffic

Performance Analysis of the Gossip based Ad Hoc Routing using Received Signal Strength for AODV

In Mobile Ad hoc Networks (MANETs), congestion control is a critical issue in controlling the degradation of network performance. During the route discovery process, the MANET routing protocol floods control packets to discover routes which may cause congestion. Currently, routing protocols take the shortest path with the minimum number of hops to reach the destination without considering the effects of Received Signal Strength (RSS). During the route discovery process, each node of MANET should not blindly broadcast without considering RSS to avoid link breakage. This causes excess energy consumption in rediscovering new routes and a greater likelihood of network partition. This paper suggests a modification of the rebroadcasting procedure for Received Requests (RREQ) in AODV using RSS on Gossip algorithm (AODV-RG). The performance of the protocol is measured based on different scenarios through metrics such as packet delivery ratio, throughput and, end-to-end delay using Network Simulator (NS 3.24.1). Experimental results show that thee AODV-RG protocol outperforms that of AODV with gossip probability p=0.66 by minimizing RREQ rebroadcasting messages during route discovery process. The Ad hoc mobile networks are suffering from the scarce power in the nodes. To decrease the amount of power consumption the AODV has been developed by many researchers by introducing the GOSSIP probability to alter the flow of RREQ. The advantage of this scheme is to decrease the overheads and the busy time of the node by detecting the RSS of the receiving node. When RSS is more than the threshold, then the RREQ is forwarded. If RSS is less than the threshold value, then RREQ is ignored. We need to test if the GOSSIP use has affected positively the quality of performance parameters such as utilization, packet delay ratio and throughput of the RREQ rebroadcast and end-to-end delay

New cloud offloading algorithm for better energy consumption and process time

Abstract. Offloading in cloud computing is a way to execute big files in short times due to the available processing resources on core computers. However in some cases it is vital to execute the file locally on the node if the file size is less than a threshold size. There is a trade off in this issue due to the limited power of the node, therefore, in this paper a novel algorithm is proposed where the file size in each case is measured and then a decision is taken to either execute the file on the node or to send the file to be processed in the core cloud. The main reason is to save time of the execution of the file. However, the second and important reason is to save the limited node energy in some large file, where the power consumption of the node will be very high. The measurement of the file size and the execution time and the power consumption for the local node and the core cloud is measured to represent an input to the execution decision Yousef, S., Yaghi, M., Tapaswi, S., Pattanaik, K. K. and Col

RSSI based adaptive indoor location tracker

Abstract Due to the impracticality of the Global Navigation Satellite Systems (GNSS) in the indoor locations, Wireless Network based Systems (WNS) are widely used for the indoor location estimation techniques. Compared to various other localization methods, the Received Signal Strength Indicator (RSSI) based techniques are highly appreciated because of their minimal complexity. Thus based on these, a generic application has been developed to track the location of any person in any area, with adequate Access Points (AP’s), by comparing the Received Signal Strength (RSS) at his/her position with the already stored set of RSS from the dataset. To find out the best possible match from a group of possible locations in the dataset, the Root Mean Square Error (RMSE) method has been used, which has less complexity and more accuracy over its alternative methods. The unique features of this application includes the dynamic database which can be conveniently updated whenever needed, live input of any indoor location map through camera and immediate creation of a new dataset, allowing the application to be used by any person in any area

Query Implementation Technique for Large Image Databases (Short Communication)

"An image indexing technique using wavelet decomposition and clustering approach, which can be employed for retrieval of images from an image database, is presented. An algorithm incorporating image indexing on the clusters of regions has been developed. This method can be employed for region-based querying of image. The querying method described in this paper has applications in different domains, including graphic design, multimedia, geology, satellite imaging, medical imaging, defence, etc. Some experimental results obtained for different feature sets using Daubechies wavelet transform and Haar wavelet transform have been presented